Gibbs fragmentation trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gibbs fragmentation trees

We study fragmentation trees of Gibbs type. In the binary case, we identify the most general Gibbs type fragmentation tree with Aldous’s beta-splitting model, which has an extended parameter range β > −2 with respect to the beta(β + 1, β + 1) probability distributions on which it is based. In the multifurcating case, we show that Gibbs fragmentation trees are associated with the two-parameter P...

متن کامل

Gibbs-non-Gibbs properties for evolving Ising models on trees

In this paper we study homogeneous Gibbs measures on a Cayley tree, subjected to an infinite-temperature Glauber evolution, and consider their (non-)Gibbsian properties. We show that the intermediate Gibbs state (which in zero field is the free-boundary-condition Gibbs state) behaves different from the plus and the minus state. E.g. at large times, all configurations are bad for the intermediat...

متن کامل

Fragmentation trees reloaded

BACKGROUND Untargeted metabolomics commonly uses liquid chromatography mass spectrometry to measure abundances of metabolites; subsequent tandem mass spectrometry is used to derive information about individual compounds. One of the bottlenecks in this experimental setup is the interpretation of fragmentation spectra to accurately and efficiently identify compounds. Fragmentation trees have beco...

متن کامل

General Fragmentation Trees

We show that the genealogy of any self-similar fragmentation process can be encoded in a compact measured R-tree. Under some Malthusian hypotheses, we compute the fractal Hausdorff dimension of this tree through the use of a natural measure on the set of its leaves. This generalizes previous work of Haas and Miermont which was restricted to conservative fragmentation processes.

متن کامل

Fragmentation of Random Trees

We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees, namely, a forest. We study statistical pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bernoulli

سال: 2008

ISSN: 1350-7265

DOI: 10.3150/08-bej134